13 research outputs found
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes
In this paper, we are interested in algorithms that take in input an
arbitrary graph , and that enumerate in output all the (inclusion-wise)
maximal "subgraphs" of which fulfil a given property . All over this
paper, we study several different properties , and the notion of subgraph
under consideration (induced or not) will vary from a result to another.
More precisely, we present efficient algorithms to list all maximal split
subgraphs, sub-cographs and some subclasses of cographs of a given input graph.
All the algorithms presented here run in polynomial delay, and moreover for
split graphs it only requires polynomial space. In order to develop an
algorithm for maximal split (edge-)subgraphs, we establish a bijection between
the maximal split subgraphs and the maximal independent sets of an auxiliary
graph. For cographs and some subclasses , the algorithms rely on a framework
recently introduced by Conte & Uno called Proximity Search. Finally we consider
the extension problem, which consists in deciding if there exists a maximal
induced subgraph satisfying a property that contains a set of prescribed
vertices and that avoids another set of vertices. We show that this problem is
NP-complete for every "interesting" hereditary property . We extend the
hardness result to some specific edge version of the extension problem
Polynomial Delay Algorithm for Minimal Chordal Completions
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In [Carmeli et al., 2020] (Pods 2017) Carmeli et al. proved that all minimal chordal completions or equivalently all proper tree decompositions of a graph can be listed in incremental polynomial time using exponential space. The total running time of their algorithm is quadratic in the number of solutions and the existence of an algorithm whose complexity depends only linearly on the number of solutions remained open. We close this question by providing a polynomial delay algorithm to solve this problem which, moreover, uses polynomial space.
Our algorithm relies on Proximity Search, a framework recently introduced by Conte and Uno [Conte and Uno, 2019] (Stoc 2019) which has been shown powerful to obtain polynomial delay algorithms, but generally requires exponential space. In order to obtain a polynomial space algorithm for our problem, we introduce a new general method called canonical path reconstruction to design polynomial delay and polynomial space algorithms based on proximity search
Polynomial Delay Algorithm for Minimal Chordal Completions
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In [Carmeli et al., 2020] (Pods 2017) Carmeli et al. proved that all minimal chordal completions or equivalently all proper tree decompositions of a graph can be listed in incremental polynomial time using exponential space. The total running time of their algorithm is quadratic in the number of solutions and the existence of an algorithm whose complexity depends only linearly on the number of solutions remained open. We close this question by providing a polynomial delay algorithm to solve this problem which, moreover, uses polynomial space.
Our algorithm relies on Proximity Search, a framework recently introduced by Conte and Uno [Conte and Uno, 2019] (Stoc 2019) which has been shown powerful to obtain polynomial delay algorithms, but generally requires exponential space. In order to obtain a polynomial space algorithm for our problem, we introduce a new general method called canonical path reconstruction to design polynomial delay and polynomial space algorithms based on proximity search
Locating Dominating Sets in local tournaments
A dominating set in a directed graph is a set of vertices such that all the vertices that do not belong to have an in-neighbour in . A locating set is a set of vertices such that all the vertices that do not belong to are characterized uniquely by the in-neighbours they have in , i.e. for every two vertices and that are not in , there exists a vertex that dominates exactly one of them. The size of a smallest set of a directed graph which is both locating and dominating is denoted by . Foucaud, Heydarshahi and Parreau proved that any twin-free digraph satisfies but conjectured that this bound can be lowered to . The conjecture is still open. They also proved that if is a tournament, i.e. a directed graph where there is one arc between every pair of vertices, then . The main result of this paper is the generalization of this bound to connected local tournaments, i.e. connected digraphs where the in- and out-neighbourhoods of every vertex induce a tournament. We also prove for all quasi-twin-free digraphs that admit a supervising vertex (a vertex from which any vertex is reachable). This class of digraphs generalizes twin-free acyclic graphs, the most general class for which this bound was known
On the hardness of inclusion-wise minimal separators enumeration
11 pages, 3 figuresEnumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal - separators and filtering out those that are not inclusion-wise minimal, at the cost of efficiency. Naturally, having an efficient algorithm for listing inclusion-wise minimal separators would drastically improve such practical algorithms. In this note, however, we show that no efficient algorithm is to be expected from an output-sensitive perspective, namely, we prove that there is no output-polynomial time algorithm for inclusion-wise minimal separators enumeration unless P = NP
On the hardness of inclusion-wise minimal separators enumeration
11 pages, 3 figuresEnumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal - separators and filtering out those that are not inclusion-wise minimal, at the cost of efficiency. Naturally, having an efficient algorithm for listing inclusion-wise minimal separators would drastically improve such practical algorithms. In this note, however, we show that no efficient algorithm is to be expected from an output-sensitive perspective, namely, we prove that there is no output-polynomial time algorithm for inclusion-wise minimal separators enumeration unless P = NP
Reactive transport experiments and modelling of CO2 sequestration in deep aquifers
International audienceNot Availabl
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
8 pages, 3 figuresThe Grundy number of a graph is the maximum number of colours used by the ``First-Fit'' greedy colouring algorithm over all vertex orderings. Given a vertex ordering , the ``First-Fit'' greedy colouring algorithm colours the vertices in the order of by assigning to each vertex the smallest colour unused in its neighbourhood. By restricting this procedure to vertex orderings that are connected, we obtain {\em connected greedy colourings}. For some graphs, all connected greedy colourings use exactly colours; they are called {\em good graphs}. On the opposite, some graphs do not admit any connected greedy colouring using only colours; they are called {\em ugly graphs}. We show that no perfect graph is ugly. We also give simple proofs of this fact for subclasses of perfect graphs (block graphs, comparability graphs), and show that no -minor free graph is ugly
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
8 pages, 3 figuresThe Grundy number of a graph is the maximum number of colours used by the ``First-Fit'' greedy colouring algorithm over all vertex orderings. Given a vertex ordering , the ``First-Fit'' greedy colouring algorithm colours the vertices in the order of by assigning to each vertex the smallest colour unused in its neighbourhood. By restricting this procedure to vertex orderings that are connected, we obtain {\em connected greedy colourings}. For some graphs, all connected greedy colourings use exactly colours; they are called {\em good graphs}. On the opposite, some graphs do not admit any connected greedy colouring using only colours; they are called {\em ugly graphs}. We show that no perfect graph is ugly. We also give simple proofs of this fact for subclasses of perfect graphs (block graphs, comparability graphs), and show that no -minor free graph is ugly